DP-TABU: an algorithm to solve single-depot multi-line vehicle scheduling problem

Abstract A DP-TABU algorithm is proposed which can effectively solve the multi-line scheduling problem of single Deport (SD-ML-VSP). The regional coordinated dispatch single-line deport bus to problems idle low-peak vehicles and insufficient peak capacity in scheduling. multiple lines at same station adjusted realize resource sharing such as timetables, vehicles, drivers. Shared departure intervals schedules. Taking service object, a vehicle operation planning model based on objective optimal public transportation resources (minimum driver costs) established optimize dispatching mode lines. We applied this three S105, S107, S159 Zhengzhou Public Transport Corporation, results proved that effective. Through comparison with manual simulated annealing algorithm, advantages performance optimization robustness are further verified.